#include"Priority_queue.h"
#include<vector>
#include<iostream>
#include<list>
#include<queue>
using namespace std;

void test_priority_queue()
{
	bit::priority_queue<int> test;
	for (int i = 0; i < 5; i++)
	{
		test.push(i);
	}
	test.pop();
	test.pop();
	test.pop();
	test.pop();
	test.pop();
	test.pop();
}
int main()
{
	test_priority_queue();

	
	return 0;
}